Master's Thesis Nr. 112

نویسندگان

  • Bojana Dimcheva
  • Donald Kossmann
چکیده

We present an indexing scheme that is capable of answering a broad range of complex top-k queries that contain a scalar product between two vectors when one of the vectors is present in the database, while the other one arrives at query time. Specifically we provide indexing facilities for the top-k closest points below (above) a hyperplane and the top-k farthest points below (above) a hyperplane, when the hyperplane is described by the scalar product equation 〈a,x〉 = b. The parameters a, b are parameters of the query, whereas the set of points that we query is materializable from the database. We provide in depth explanation of the algorithms and data structures that compose our indexing scheme. Furthermore, we evaluate and compare the performance of our index with an exhaustive search baseline algorithm, with different types of queries, on synthetic datasets. In addition to the baseline comparison, we compare our indexing scheme with an alternative solution method, that uses completely different approach. The space consumption of the index is parametrizable, and depending on the performance needs and available memory can range from extremely lightweight to more demanding. The query time complexity is logarithmic on the number of data points in the best case and linear on the number of data points in the worst case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Guide to Writing a Master's Thesis

This paper serves as a guide for the students admitted to a course, quali ed as a Master's Course, at Stockholm University, department of Computer and Systems Sciences. The goal of the course is to train the students in scienti c work and scienti c writing, intended to result in a Master's thesis. This paper brie y describes the di erent choices the students can make, in uencing their work with...

متن کامل

Evaluating the quality of master degree thesis of Educational Psychology graduates

The purpose of the present research was to evaluate and identify the quality and the weaknesses and strengths of different sections of master's degree thesis in educational psychology at Tehran universities. The research method was evaluation and the statistical population included all the master's degree theses in the field of educational psychology at Tehran universities during the 2013-2016 ...

متن کامل

Master's Thesis Nr. 125 Efficiently Executing the Dragonet Network Stack

Today’s network cards are getting more and more complex. One reason for this is that networks are still getting faster, while cores are not. Two common approaches for allowing network stacks to keep up, are distributing packets to multiple cores directly in the network card, and moving protocol processing fully or partially to the network card. However current network stacks were not designed t...

متن کامل

Master's Thesis Nr. 104 Business Rules Retrieval and Processing

Business Rules Engines are systems created to deliver relevant business information to applications and business processes that depend on them. Given their critical position, efficient indexing to minimize time and memory consumption is essential. Unfortunately, the usage of standard hashing indexing techniques has proved not to be an efficient solution to the problem, both in term of performan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014